Open Problems in Parameterized and Exact Computation — IWPEC 2006

Open Problems in Parameterized and Exact Computation — IWPEC 2006 Hans

In September 2006, the Second International Workshop on Parameterized and Exact Computation was held in Zürich, Switzerland, as part of ALGO 2006. At the end of IWPEC 2006, a problem session was held. (Most of) the problems mentioned at this problem session, and some other problems, contributed by the participants of IWPEC 2006 are listed here.

Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans

Parameterized Approximation Problems

Parameterized complexity is fast becoming accepted as an important strand in the mainstream of algorithm design and analysis. Up until now, most of the work in the area has focussed on exact algorithms for decision problems. The goal of the present paper is to apply parameterized ideas to approximation. We begin exploration of parameterized approximation problems, where the problem in question ...

On Parameterized Approximability

Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems.

The Parameterized Complexity of Maximality and Minimality Problems

Many parameterized problems (as the clique problem or the dominating set problem) ask, given an instance and a natural number k as parameter, whether there is a solution of size k. We analyze the relationship between the complexity of such a problem and the corresponding maximality (minimality) problem asking for a solution of size k maximal (minimal) with respect to set inclusion. As our resul...